Heap – ternary algebraic structure ∗
نویسندگان
چکیده
In this paper some classes of ternary algebraic structures (semi-heaps, heaps) are considered. The connection between heaps (laterally commutative heaps) and corresponding algebraic and geometric structures is presented. The equivalence of heap existence and the Desargues system on the same set is directly proved. It is the starting point for an analogous result about a laterally commutative heap and a parallelogram space.
منابع مشابه
Stability Analysis and Stabilization of Miduk Heap Leaching Structure, Iran
To construct copper heap leaching structures, a stepped heap of ore is placed over an isolated sloping surface and then washed with sulphuric acid. The isolated bed of such a heap consists of some natural and geosynthetic layers. Shear strength parameters between these layers are low, so they form the possible sliding surfaces of the heaps. Economic and environmental considerations call for stu...
متن کاملEffects of Pregnant Leach Solution Temperature on the Permeability of Gravelly Drainage Layer of Heap Leaching Structures
In copper heap leaching structures, the ore is leached by an acidic solution. After dissolving the ore mineral, the heap is drained off in the acidic solution using a drainage system (consisting of a network of perforated polyethylene pipes and gravelly drainage layers) and is, then, transferred to the leaching plant for copper extraction where the copper is extracted and the remaining solution...
متن کاملA New Analytical Solution for Determination of Acceptable Overall settlement of Heap Leaching Structures Foundation
There are some artificial and natural materials on foundation of heap leaching structures. Geomembrane liner is the most important artificial isolated layer of these structures. The thickness of this layer is about 1 to 2 mm. Foundation overall settlement of such structures changes the primary length of the geomembrane layer. If the strain of geomembrane is more than allowable one, the layer wi...
متن کاملSymbolic Resource Bound Inference for Functional Programs
We present an approach for inferring symbolic resource bounds for purely functional programs consisting of recursive functions, algebraic data types and nonlinear arithmetic operations. In our approach, the developer specifies the desired shape of the bound as a program expression containing numerical holes which we refer to as templates. For e.g, time ≤ a ∗ height(tree) + b where a, b are unkn...
متن کاملTHE LATTICE OF CONGRUENCES ON A TERNARY SEMIGROUP
In this paper we investigate some properties of congruences on ternary semigroups. We also define the notion of congruence on a ternary semigroup generated by a relation and we determine the method of obtaining a congruence on a ternary semigroup T from a relation R on T. Furthermore we study the lattice of congruences on a ternary semigroup and we show that this lattice is not generally modular...
متن کامل